On the Decomposition of Boolean Functions via Boolean Equations

نویسنده

  • Sergiu Rudeanu
چکیده

We propose an alternative solution to the problems solved in [1]. Our aim is to advocate the efficiency of algebraic methods for the solution of the Boolean equations which occur in the decomposition of Boolean functions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

On Decomposing Systems of Boolean Functions via Ternary Matrix Cover Approach

The problem of two-block disjoint decomposition of completely specified Boolean functions is considered. Recently a good method in functional decomposition category was proposed. This method is based on using the ternary matrix cover approach. Due to investigation and analysis of this method and to search for an appropriate partition, a computer program was developed. After running the program ...

متن کامل

Filter theory in MTL-algebras based on Uni-soft property

‎The notion of (Boolean) uni-soft filters‎ ‎in MTL-algebras is introduced‎, ‎and several properties of them are‎ ‎investigated‎. ‎Characterizations of (Boolean) uni-soft filters are discussed‎, ‎and some (necessary and sufficient) conditions‎ ‎for a uni-soft filter to be Boolean are provided‎. ‎The condensational property for a Boolean uni-soft filter is established.

متن کامل

Decomposition of Boolean Function Sets for Boolean Neural Networks

This paper presents a new type of neuron, called Boolean neuron. We suggest algorithms for decomposition of Boolean functions sets based on Boolean neural networks that include only Boolean neurons. The advantages of these neural networks consist in the reduction of memory space and computation time in comparison to the representation of Boolean functions by usual neural networks. The Boolean n...

متن کامل

Boolean Differential Equations

The expressiveness of Boolean Algebras is significantly extended by the Boolean Differential Calculus (BDC). The additionally defined differentials of Boolean variables, differentials and further differential operators of Boolean functions as well as several derivative operations of Boolean functions allow to model changes of function values together with changes of the values of variables and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2004